週次 |
日期 |
單元主題 |
Week 1 |
2/22 |
Opening & Asymptotic Analysis: CH1, CH2, CH3
PA: 0 & 1 out
HW: 1 out
Recitation: Course enrollment, course rules |
Week 2 |
2/29 |
Divide and Conquer: CH4
Recitation: EDA Union, recourses |
Week 3 |
3/7 |
Heap Sort: CH6
Quick Sort: CH7 |
Week 4 |
3/14 |
Sorting in Linear Time: CH8
Medians and Order Statistics: CH9
Quiz #1 (3/14 11:40am)
HW: 1 in (before class) & 2 out |
Week 5 |
3/21 |
Binary Search Trees: CH12
Dynamic Programming: CH14
PA: 1 in (3/24 Sun 1pm) |
Week 6 |
3/28 |
Dynamic Programming: CH14
PA: 2 out |
Week 7 |
4/4 |
No class (Children’s Day) |
Week 8 |
4/11 |
Greedy Algorithms: CH15
Amortized Analysis: CH16
Quiz #2 (4/11 11:40am)
PA: 2 in (4/23 Sun 1pm)
HW: 2 in (before class; no late submission)
Recitation: Review |
Week 9 |
4/18 |
Midterm (4/18 Thu 9:20am-12:10pm)
HW: 3 out |
Week 10 |
4/25 |
Amortized Analysis: CH16
Elementary Graph Algorithms: CH20
PA: 2 in (4/28 Sun 1pm) |
Week 11 |
5/2 |
Disjoint Sets: CH19
Minimum Spanning Trees: CH21 |
Week 12 |
5/9 |
Single-Source Shortest Paths: CH22
Quiz #3 (5/9 11:40am)
PA: 3 out
HW: 3 in (before class) & 4 out |
Week 13 |
5/16 |
All-Pairs Shortest Paths: CH23
Maximum Flow: CH24 |
Week 14 |
5/23 |
Maximum Flow: CH24
NP-Completeness: CH34 |
Week 15 |
5/30 |
NP-Completeness: CH34
Quiz #4 (6/1 Thu 11:40am)
DIY problem in (6/3 Mon 6pm)
HW: 4 in (6/3 Mon 6pm; no late submission) SAT solution (6/4)
Recitation: Review |
Week 16 |
6/6 |
Final (6/6 Thu 9:20am-12:10pm) |
Week 17 |
6/13 |
No class
PA: 3 in (6/13 Thu 1pm) |